Transgenic: An evolutionary algorithm operator

نویسندگان

  • Laurence Rodrigues do Amaral
  • Estevam R. Hruschka
چکیده

Traditionally, many evolutionary algorithm operators have biological inspiration. Genetics has contributed to the proposal of a number of different evolutionary operators, such as haploid crossover, mutation, diploid, inversion, gene doubling, deletion, and others. In the present study, we propose a new geneticinspired evolutionary operator, named Transgenic, which was specially designed for Genetic Algorithms (GA). The proposed operator is inspired by genetically modified organisms (GMOs), where important features are artificially introduced into their genome. Transgenic can be used to artificially insert relevant characteristics in the chromosome of individuals, thus converging to better results faster than traditional GAs. When relevant characteristics are known a prior, then, Transgenic simply forces the presence of such characteristics in part of the population (in an elitism-based approach). Whenever there is no a priori knowledge available, Transgenic automatically identifies relevant features (based on historical information) to perform the elitism approach. The GA, used in this study was designed to allow the discovery of concise, yet accurate, high-level rules (from synthetic and real biological databases) which can be used as a classification system. The empirical results have shown that Transgenic is capable of generating better results than traditional rule classification methods, such as J48, Single Conjunctive Rule Learner, One R and PART, using synthetic datasets. & 2013 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems

Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...

متن کامل

Optimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System

In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...

متن کامل

Optimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System

In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...

متن کامل

Participative Biogeography-Based Optimization

Biogeography-Based Optimization (BBO) has recently gained interest of researchers due to its simplicity in implementation, efficiency and existence of very few parameters. The BBO algorithm is a new type of optimization technique based on biogeography concept. This population-based algorithm uses the idea of the migration strategy of animals or other species for solving optimization problems. t...

متن کامل

Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm

The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Neurocomputing

دوره 127  شماره 

صفحات  -

تاریخ انتشار 2014